Optimal Four-Dimensional Codes over GF(8)
نویسندگان
چکیده
منابع مشابه
Optimal Four-Dimensional Codes over GF(8)
We prove the nonexistence of several four-dimensional codes over GF(8) that meet the Griesmer bound. The proofs use geometric methods based on the analysis of the weight structure of subcodes. The specific parameters of the codes ruled out are: [111, 4, 96], [110, 4, 95], [102, 4, 88], [101, 4, 87], [93, 4, 80], and the sequence [29 − j, 4, 24 − j], for j = 0, 1, 2.
متن کاملCommutative curvature operators over four-dimensional generalized symmetric spaces
Commutative properties of four-dimensional generalized symmetric pseudo-Riemannian manifolds were considered. Specially, in this paper, we studied Skew-Tsankov and Jacobi-Tsankov conditions in 4-dimensional pseudo-Riemannian generalized symmetric manifolds.
متن کاملOptimal Linear Codes over Z
We examine the main linear coding theory problem and study the structure of optimal linear codes over the ring Zm. We derive bounds on the maximum Hamming weight of these codes. We give bounds on the best linear codes over Z8 and Z9 of lengths up to 6. We determine the minimum distances of optimal linear codes over Z4 for lengths up to 7. Some examples of optimal codes are given.
متن کاملOptimal Linear Codes Over GF(7) and GF(11) with Dimension 3
Let $n_q(k,d)$ denote the smallest value of $n$ for which there exists a linear $[n,k,d]$-code over the Galois field $GF(q)$. An $[n,k,d]$-code whose length is equal to $n_q(k,d)$ is called {em optimal}. In this paper we present some matrix generators for the family of optimal $[n,3,d]$ codes over $GF(7)$ and $GF(11)$. Most of our given codes in $GF(7)$ are non-isomorphic with the codes pre...
متن کاملSome Optimal Codes From Designs
The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2006
ISSN: 1077-8926
DOI: 10.37236/1069